Community Detection in Bipartite Networks Using a Noisy Extremal Optimization Algorithm
نویسندگان
چکیده
The network community structure detection problem consists in finding groups of nodes that are more connected to each other than to the rest of the network. While many methods have been designed to deal with this problem for general networks, there are few methods that deal with bipartite ones. In this paper we explore the behavior of an optimization method designed for identifying the community structure of unweighted networks when dealing with bipartite networks. We find that by using the specific Barber modularity, results are comparable with those reported in literature.
منابع مشابه
Noisy images edge detection: Ant colony optimization algorithm
The edges of an image define the image boundary. When the image is noisy, it does not become easy to identify the edges. Therefore, a method requests to be developed that can identify edges clearly in a noisy image. Many methods have been proposed earlier using filters, transforms and wavelets with Ant colony optimization (ACO) that detect edges. We here used ACO for edge detection of noisy ima...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملA Hybrid Algorithm for Community Detection Using PSO and EO
Community detection in networks is one of the most prominent areas of network science which is very hard and not yet satisfactorily solved. A hybrid algorithm based on particle swarm optimization (PSO) and Extremal Optimization (EO) for community detection is. PSO algorithm has strong global search ability but is easily to trap into the local optima, while EO algorithm can make the search to ju...
متن کاملCommunity detection in complex networks using extremal optimization.
We propose a method to find the community structure in complex networks based on an extremal optimization of the value of modularity. The method outperforms the optimal modularity found by the existing algorithms in the literature giving a better understanding of the community structure. We present the results of the algorithm for computer-simulated and real networks and compare them with other...
متن کاملAnt Colony Optimization for Detecting Communities from Bipartite network
In this paper, an algorithm based on ant colony optimization for community detection from bipartite networks is presented. The algorithm establishes a model graph for the ants’ searching. Each ant chooses its path according to the pheromone and heuristic information on each edge to construct a solution. Experimental results show that our algorithm can not only accurately identify the number of ...
متن کامل